Extender sets and multidimensional subshifts
نویسندگان
چکیده
منابع مشابه
The Extender Algebra and Preserving Stationary Sets
We give an instance when the extender algebra can preserve stationary subsets of ω1. In particular, we show that for any model operator satisfying certain conditions (satisfied by the currently known minimal inner models for large cardinal statements), any Ω-consistent statement about a rank initial segment of the universe can be forced over canonical model containing H(ω2) while preserving sta...
متن کاملHardness of conjugacy, embedding and factorization of multidimensional subshifts
Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts in dimensions d > 1 for subshifts of finite type and sofic shifts and in dimensions d ≥ 1 for effective shifts. In particular, we prove that...
متن کاملuniform distribution theory MULTIDIMENSIONAL EFFECTIVE S - ADIC SUBSHIFTS ARE SOFIC
In this article we prove that multidimensional effective S-adic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts. Communicated by Pierre Liardet
متن کاملExtender based forcings, fresh sets and Aronszajn trees
Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model with no Aronszajn tree over אω+2 from the optimal assumptions. This answers a question of Friedman and Halilović [1]. The reader interested only in Friedman and Halilović question may skip the first section and go directly to the second. 1 No branches to κAronszajn trees. We deal here wi...
متن کاملSubshifts with Slowly Growing Numbers of Follower Sets
For any subshift, define FX(n) to be the collection of distinct follower sets of words of length n in X. Based on a similar result proved in [4], we conjecture that if there exists an n for which |FX(n)| ≤ n, then X is sofic. In this paper, we prove several results related to this conjecture, including verifying it for n ≤ 3, proving that the conjecture is true for a large class of coded subshi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2014
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2014.71